A Hamiltonian Path-Based Enciphering Technique with the use of a Self-Invertible Key Matrix

Objective: The symmetric encryption technique is one of the most important fields for securing communications between people. In order to produce complex ciphertext, we are introducing new enciphering with help Hamiltonian path, a self-invertible key matrix and decryption. Methods: There many kinds methods, like Caesar Cipher, Atbash Hill etc. All these methods use common encryption, while decrypting inverse that should be found, it also too hard share key. To reduce this terminology, proposed novel method matrix. Findings: We using generated selfinvertible as matrix; degree even. If our graph does not form an even-degree adjacency matrix, then have make into by adding dummy edges. Novelty: As do need compute process This helps us complexity finding original message. Keywords: Graph Theory Encryption; Cipher; Path; Adjacency Matrix; Self Invertible Matrix